On the Impact of the Data Redundancy Strategy on the Recoverability of Friend-to-Friend Backup Systems
نویسندگان
چکیده
Social network-based systems, also known as Friend-to-Friend (F2F) systems, are a promising approach to develop backup solutions that provide high reliability with a much lower consumption of bandwidth and storage than P2P ones. F2F backup systems can use two data redundancy strategies to handle peer failure events, namely: replication and erasure coding. In this paper we evaluate the use of these alternatives to handle failures in F2F backup systems. The assessment is conducted using a new metric named recoverability slowdown. The proposed metric represents how efficiently one can restore the data lost due to the occurrence of failures. Our aim is to determine which data redundancy scheme constitutes a more balanced solution in terms of recoverability slowdown under different network bandwidth capacities and storage overhead levels. The simulations we have performed indicate that an increase on the storage overhead leads to better values for the backup recoverability slowdown when using the replication technique, while it leads to worse values when using the erasure coding technique. Moreover, using enough redundancy, replication can achieve results that are close to the optimal case for recoverability slowdown, while the best performance achieved by erasure coding is not larger than 87% of the optimal case. Nevertheless, for relatively low values of storage overhead, erasure coding outperforms replication.
منابع مشابه
Viscosity Calculation of Supercritical Gases Based on the Rainwater-Friend Theory and the Modified Enskog Theory
A new correlation function for the calculation of viscosity for five typical supercritical gases is presented using the rainwater-Friend and modified Enskog theory. It is shown that by using accurate value for the thermal pressure and co-volume in the modified Enskog theory, this correlation function is suitable for calculation of the viscosity of supercritical gases, without any density an...
متن کاملReliability Optimization for Complicated Systems with a Choice of Redundancy Strategies (TECHNICAL NOTE)
Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملKant: Friend or Foe of the Believer? Plantinga and Other American Christian Responses to Kant's Epistemology
متن کامل
A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کامل